Location-Unaware Node Scheduling Schemes Based on Boundary Nodes in Wireless Sensor Networks

Node scheduling scheme of sensor nodes is one of the most important method to solve the energy-constrained wireless sensor networks. Traditional methods of node scheduling that without location information leads to a node in the border of monitored region first death due to no more chance enter into sleep state, and then the death spread to the central region. This phenomenon is called as inequality sleep problems. To address this problem, we propose a method to determine some boundary nodes only using the minimum cost of nodes and the neighbors’ distance without any location information. We develop a location-Unaware nodes-scheduling schemes based on these determined boundary nodes called as LUNSB. Simulation results demonstrate that B-LUNS not only alleviates the inequality sleep problems, but also prolongs network lifetime.